Adaptive projection methods for linear fractional programming
نویسندگان
چکیده
In this paper, we are interested in solving a linear fractional program by two different approaches. The first one is based on interior point methods which makes it possible to solve an equivalent the program. second allows us variational inequalities problem efficient projection method. Numerical tests were carried out approaches and comparative study was out. numerical show clearly that more than of one.
منابع مشابه
Chapter 19 ADAPTIVE MEMORY PROJECTION METHODS FOR INTEGER PROGRAMMING
Projection methods, which hold selected variables fixed while manipulating others, have a particularly useful role in metaheuristic procedures, especially in connection with large scale optimization and parallelization approaches. This role is enriched by adaptive memory processes of tabu search, which provide a collection of easily stated strategies to uncover improved solutions during the cou...
متن کاملSENSITIVITY ANALYSIS IN LINEAR-PLUS-LINEAR FRACTIONAL PROGRAMMING PROBLEMS
In this paper, we study the classical sensitivity analysis when the right - hand – side vector, and the coefficients of the objective function are allowed to vary.
متن کاملProjection Methods for Linear Systems
The aim of this paper is to give a uniied framework for deriving projection methods for solving systems of linear equations. We shall show that all these methods follow from a unique minimization problem. The particular cases of the methods of steepest descent, Richardson and conjugate gradients will be treated in details. Projection acceleration procedures for accelerating the convergence of a...
متن کاملStable barrier-projection and barrier-Newton methods in linear programming
The present paper is devoted to the application of the space transformation techniques for solving linear programming problems. By using a surjective mapping the original constrained optimization problem is transformed to a problem in a new space with only equality constraints. For the numerical solution of the latter problem the stable version of the gradient-projection and Newton’s methods ar...
متن کاملA polynomial projection algorithm for linear programming
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear equations and non-negativity constraints. Then it uses a procedure that either finds a solution for the respective homogeneous system or provides the information based on which the algorithm rescales the homogeneous system so that its fea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2021
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2020091